The generator matrix

 1  0  0  1  1  1  X  1  1  0  X  1  0  1  1  1  1  X  1  1  X  1  0  X  1  1  0  X  1  1  0  1  1  0  1  1  0  1  1  0  1  1  0  X  1  1  1  1  1  1  1  0  1  1  X  1  1  1  1  1  1  1  X  0  X  0  1  1
 0  1  0  0  1  1  1  0  X  0  1  1  1  X X+1 X+1  X  X  X  0  X X+1  1  1 X+1  1  1  1  0  X  0  X  0  X  0  X  0  X  0  X  1  1  1  1  X  0  0  X X+1 X+1  1  1  0  1  1 X+1  0 X+1  1  0  0 X+1  X  X  0  0 X+1  1
 0  0  1  1  1  0  1  X X+1  1 X+1 X+1  X  1  0  X  X  1  0 X+1  1 X+1  0  1  1  X  X X+1  0  1  1  X X+1  1  X X+1  1  0  1  1  1  1  0  X X+1  1 X+1 X+1  0  0  1  0 X+1  1  X  X X+1  0  0 X+1  1  X  0  X  0  X  0  0
 0  0  0  X  0  0  0  0  0  0  0  0  0  0  X  X  X  X  X  X  X  X  X  X  X  0  X  X  X  X  X  0  0  0  X  X  X  0  0  0  0  X  0  X  X  0  X  0  0  X  0  X  0  X  0  X  0  0  0  X  X  0  X  X  X  X  0  0
 0  0  0  0  X  0  0  X  X  X  X  0  X  0  X  0  X  X  0  X  0  X  X  0  0  X  0  X  0  X  X  0  X  X  X  0  0  X  0  0  0  X  X  0  X  0  0  0  0  0  X  X  X  0  0  X  0  X  0  X  X  X  X  X  0  0  0  X
 0  0  0  0  0  X  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  X  X  X  X  X  X  X  X  X  X  X  X  X  X  X  X  X  X  X  X  0  X  0  X  0  X  0  X  0  X  0  0  0  X  0  X  0  0  X  0  X  X  X  0  0  0  0

generates a code of length 68 over Z2[X]/(X^2) who�s minimum homogenous weight is 64.

Homogenous weight enumerator: w(x)=1x^0+233x^64+132x^68+98x^72+8x^76+32x^80+4x^84+2x^88+2x^96

The gray image is a linear code over GF(2) with n=136, k=9 and d=64.
As d=64 is an upper bound for linear (136,9,2)-codes, this code is optimal over Z2[X]/(X^2) for dimension 9.
This code was found by Heurico 1.16 in 3.3 seconds.